Statistical Estimation and Optimal Recovery
نویسنده
چکیده
New formulas are given for the minimax linear risk in estimating a linear functional of an unknown object from indirect data contaminated with random Gaussian noise. The formulas cover a variety of loss functions, and do not require the symmetry of the convex a priori class. It is shown that affine minimax rules are within a few percent of minimax even among nonlinear rules, for a variety of loss functions. It is also shown that difficulty of estimation is measured by the modulus of continuity of the functional to be estimated. The method of proof exposes a correspondence between minimax affine estimates in the statistical estimation problem and optimal algorithms in the theory of optimal recovery.
منابع مشابه
Unconditional Bases are Optimal Bases for Data Compression and for Statistical Estimation
An orthogonal basis of L which is also an unconditional basis of a functional space F is a kind of optimal basis for compressing, estimating, and recovering functions in F . Simple thresholding operations, applied in the unconditional basis, work essentially better for compressing, estimating, and recovering than they do in any other orthogonal basis. In fact, simple thresholding in an uncondit...
متن کاملImprove Estimation and Operation of Optimal Power Flow(OPF) Using Bayesian Neural Network
The future of development and design is impossible without study of Power Flow(PF), exigency the system outcomes load growth, necessity add generators, transformers and power lines in power system. The urgency for Optimal Power Flow (OPF) studies, in addition to the items listed for the PF and in order to achieve the objective functions. In this paper has been used cost of generator fuel, acti...
متن کاملComputationally Efficient Robust Sparse Estimation in High Dimensions
Many conventional statistical procedures are extremely sensitive to seemingly minor deviations from modeling assumptions. This problem is exacerbated in modern high-dimensional settings, where the problem dimension can grow with and possibly exceed the sample size. We consider the problem of robust estimation of sparse functionals, and provide a computationally and statistically efficient algor...
متن کاملHardest One-Dimensional Subproblems
For a long time, lower bounds on the difficulty of estimation have been constructed by showing that estimation was difficult even in certain 1-dimensional subproblems. The logical extension of this is to identify hardest one dimensional subproblems and to ask whether these are, either exactly or approximately, as difficult as the full problem. We do this in three settings: estimating linear fun...
متن کاملA Hybrid Fuzzy MCDM Approach to Determine an Optimal Block Size in Open-Pit Mine Modeling: a Case Study
The computer-based 3D modeling of ore bodies is one of the most important steps in the resource estimation, grade determination, and production scheduling of open-pit mines. In the modeling phase, the volume of the orebody model is required to be filled by the blocks and sub-blocks. The determination of Block Size (BS) is important due to the dependence of the geostatistical issues and calculat...
متن کامل